e-LEARNING: A CASE STUDY OF CHOR-RIVEST CRYPTOSYSTEM IN MAPLE
نویسندگان
چکیده
A new experience teaching programming and numerical methods to engineering students, using Maple to implement the Chor-Rivest cryptosystem, is shown. The aim is to give the students a better understanding of cryptography by using Maple software. In this paper we discuss our attempts to structure an on-line course that required the students participation, interest, and evaluation by means of a new
منابع مشابه
Safer parameters for the Chor-Rivest cryptosystem
Vaudenay’s cryptanalysis to Chor-Rivest cryptosystem is not applicable if the parameters p and h of the finite field are both prime integers. This case is analyzed below and the parameters for which such cryptosystem is cryptographically interesting are listed. Regrettably the resulting cryptosystems are not very efficient in practice.
متن کاملAlgorithms to encrypt and decrypt messages with Magma ∗
The security in current communications recommend to develop the implementation of cryptographic primitives and algorithms in an effective way. The cryptosystem proposed by Chor and Rivest, which is based on the knapsack problem, has recently been broken by Vaudenay but only when the original parameters are used. In this paper we give a brief overview of some developments in Cryptography and we ...
متن کاملAnalysis of the efficiency of the Chor-Rivest cryptosystem implementation in a safe-parameter range
The Chor-Rivest cryptosystem, based on a high-density knapsack problem on a finite field Fqh , was broken by S. Vaudenay for q ≈ 200, h ≈ 24, and h admitting a factor s verifying a certain condition. A new set of parameters q and h, which prevent this cryptosystem against Vaudenay’s attack, is presented and the computational aspects of its implementation in the Magma computational algebra syste...
متن کاملAttacking the Chor-Rivest Cryptosystem by Improved Lattice Reduction
We introduce algorithms for lattice basis reduction that are improvements of the famous L 3-algorithm. If a random L 3 {reduced lattice basis b1; : : : ; bn is given such that the vector of reduced Gram{ Schmidt coeecients (fi;jg 1 j < i n) is uniformly distributed in 0; 1) (n 2) , then the pruned enumeration nds with positive probability a shortest lattice vector. We demonstrate the power of t...
متن کاملLow-density attack revisited
The low-density attack proposed by Lagarias and Odlyzko is a powerful algorithm against the subset sum problem. The improvement algorithm due to Coster et al. would solve almost all the problems of density < 0.9408... in the asymptotical sense. On the other hand, the subset sum problem itself is known as an NP-hard problem, and a lot of efforts have been paid to establish public-key cryptosyste...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009